A Hybrid Metaheuristic for Multiple Runways Aircraft Landing Problem Based on Bat Algorithm
نویسندگان
چکیده
منابع مشابه
A hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملHybrid Algorithms for the Multiple Runway Aircraft Landing Problem
Over the past few decades, air traffic has experienced a tremendous Growth. However, as the air traffic develops, the limitation of the runway becomes the bottleneck during the airport operation and scheduling aircraft landing present a complex daily task encountered by most air traffic control towers. In this paper, we study the Multiple Runway case of the Aircraft Landing Problem (MRALP), whi...
متن کاملAn exact algorithm for Aircraft Landing Problem
This paper addresses the problem of scheduling aircraft landings at an airport. Given a set of planes and runways, the objective is to minimize the total (weighted) deviation from the target landing time for each plane. There are costs associated with landing either earlier or later than a target landing time for each plane. Each plane has to land on one of the runways within its predetermined ...
متن کاملSolving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach
Aircraft Landing Problem is to assign an airport’s runways to the arrival aircraft as well as to schedule the landing time of these aircraft. In this paper, due to the complexity of the problem, which is NP-hard, we develop an iterative-based heuristic by exploiting special characteristics of the problem. Computational results show the developed approach is quite competitive, and obtain optimal...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/742653